Combination of Isabelle/HOL with Automatic Tools

نویسنده

  • Sergey Tverdyshev
چکیده

We describe results and status of a sub project of the Verisoft [1] project. While the Verisoft project aims at verification of a complete computer system starting with hardware and up to user applications, the goal of our sub project is an efficient hardware verification. We use the Isabelle theorem prover [2] as the major tool for hardware design and verification. Since many hardware verification problems can be efficiently solved by automatic tools, we combine Isabelle with model checkers and SAT solvers. This combination of tools speeds up verification of hardware and simplifies sharing of the results with verification of the whole computer system. To increase the range of problems which can be solved by external tools we implemented in Isabelle several algorithms for handling uninterpreted functions and data abstraction. The resulting combination was applied to verify many different hardware circuits, automata, and processors. In our project we use open source tools that are free for academical and commercial purposes.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Formalization of Termination Techniques in Isabelle/HOL

There are many automatic tools to prove termination of term rewrite systems, nowadays. Most of these tools use a combination of many complex termination criteria. Hence generated proofs may be of tremendous size, which makes it very tedious (if not impossible) for humans to check those proofs for correctness. In this paper we use the theorem prover Isabelle/HOL to automatically certify terminat...

متن کامل

Automatic Proof and Disproof in Isabelle/HOL

Isabelle/HOL is a popular interactive theorem prover based on higherorder logic. It owes its success to its ease of use and powerful automation. Much of the automation is performed by external tools: The metaprover Sledgehammer relies on resolution provers and SMT solvers for its proof search, the counterexample generator Quickcheck uses the ML compiler as a fast evaluator for ground formulas, ...

متن کامل

Expressiveness + Automation + Soundness: Towards Combining SMT Solvers and Interactive Proof Assistants

Formal system development needs expressive specification languages, but also calls for highly automated tools. These two goals are not easy to reconcile, especially if one also aims at high assurances for correctness. In this paper, we describe a combination of Isabelle/HOL with a proof-producing SMT (Satisfiability Modulo Theories) solver that contains a SAT engine and a decision procedure for...

متن کامل

A Proof Strategy Language and Proof Script Generation for Isabelle/HOL

Interactive theorem provers, such as Isabelle, include various automatic tools for finding proofs under certain conditions. However, for each conjecture, knowing which tool to use, and how to tweak its parameters, is currently labour intensive. We have developed a language, PSL, designed to capture high level proof strategies. PSL offloads the construction of human-readable fast-to-replay proof...

متن کامل

Beyond Linear Arithmetic: Automatic Proof Procedures for the Reals

1 Previous Research and Track Record Lawrence C. Paulson is Professor of Computational Logic at the University of Cambridge, where he has held established posts since 1983. Paulson’s early work on LCF contributed much (both code and concepts) to HOL. Paulson introduced Isabelle in 1986 and has been building upon it ever since. Isabelle is a generic proof tool that supports higher-order logic (H...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005